A CLP View of Logic Programming
نویسنده
چکیده
We address the problem of determining those constraint domains A for which the traditional logic programming semantics and the constraint logic programming semantics C LP (A) coincide. This reduces to a study of non-standard models of Clark's axioms and the notion of solution compact-ness introduced in the CLP scheme. The results of this study include the proof of the existence of a free product in the class of algebras deened by Clark's axioms, a characterization of when Clark's axioms form a model complete theory, and a limited characterization of those models of Clark's axioms which form solution compact constraint domains.
منابع مشابه
Clp() for Automatically Proving Program Properties 1
Various proof methods have been proposed to solve the implication problem , i.e. proving that properties of the form : 8(P ! Q)-where P and Q denote conjunctions of atoms-are logical consequences of logic programs. Nonetheless, it is a commonplace to say that it is still quite a diicult problem. Besides, the advent of the constraint logic programming scheme constitutes not only a major step tow...
متن کاملA Practical Approach to the Global Analysis of CLP Programs
This paper presents and illustrates with an example a practical approach to the dataflow analysis of programs written in constraint logic programming (CLP) languages using abstract interpretation. It is first argued tha t , from the framework point of view, it sufnces to propose relatively simple extensions of traditional analysis methods which have already been proved useful and practical and ...
متن کاملConstraint functional logic programming over finite domains
In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP (FD) ) with a lazy functional logic programming language which seamlessly embodies finite domain (FD) constraints. This proposal increases the expressiveness and power of constraint logic programming over finite domains (CLP (FD) ) by combining functional and relational notation, curried ...
متن کاملConstraint Logic Programming for Natural Language Processing
This paper proposes an evaluation of the adequacy of the constraint logic programming paradigm for natural language processing. Theoretical aspects of this question have been discussed in several works (see for example [Smolka89] or [Aı̈t-Kaci92]). We adopt here a pragmatic point of view and our argumentation relies on concrete solutions. Using actual contraints (in the CLP sense) is neither eas...
متن کاملConstraint logic programming for qualitative and quantitative constraint satisfaction problems
AI and OR approaches have complementary strengths: AI in domain-specific knowledge representation and OR in efficient mathemat:ical computation. Constraint Logic Programming (CLP), which combines these complementary strengths of the AI and OR approach, is introduced as a new tool to formalize a special class of constraint satisfaction problems that include both qualitative and quantitative cons...
متن کاملTowards a glass-box typed CLP language
Constraint Logic Programming (CLP) merges two declarative paradigms: constraint solving and logic programming. This combination increases the efficiency of logical programming languages and, in some cases, makes programs more expressive than other kinds of programs. CLP has progressed in several quite different directions such as parallelism, concurrency, development of satisfiable algorithms i...
متن کامل